ON RELIABILITY OF NON-BRANCHING PROGRAMMES IN THE BASIS
INCLUDING THE FUNCTION OF THE TYPE X₁^a1 V X₂^a2

Grabovskaya Svetlana Mikhaylovna, Assistant, sub-department of discrete mathematics, Penza State University, swetazin@mail.ru

519.718

The problem of synthesis of nobranching programs with conditional stop-operator is considered in full finite basis, contained some kind function x₁^a1vx₂^a2,a₁,a₂∈{0,1}. All functional operators are supposed to be prone output inverse failures with probability ε(ε∈(0,1/2)). Conditional stop-operators are absolutely reliable. Any boolean function is proved to be possible to realize by nobranching program, functioned with unreliability no more ε+81ε² at ε∈(0,1/960].

boolean functions, nobraching programs, conditional stop-operator, synthesis, reliability.